Polynomial splines on the real line

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable degree polynomial splines are Chebyshev splines

Variable degree polynomial (VDP) splines have recently proved themselves as a valuable tool in obtaining shape preserving approximations. However, some usual properties which one would expect of a spline space in order to be useful in geometric modeling, do not follow easily from their definition. This includes total positivity (TP) and variation diminishing, but also constructive algorithms ba...

متن کامل

POINTWISE PSEUDO-METRIC ON THE L-REAL LINE

In this paper, a pointwise pseudo-metric function on the L-realline is constructed. It is proved that the topology induced by this pointwisepseudo-metric is the usual topology.

متن کامل

Bases for Non-homogeneous Polynomial Ck Splines on the Sphere

We investigate the use of non-homogeneous spherical poly-nomials for the approximation of functions deened on the sphere S 2. A spherical polynomial is the restriction to S 2 of a polynomial in the three coordinates x; y; z of R 3. Let P d be the space of spherical polynomials with degree d. We show that P d is the direct sum of H d and H d?1 , where H d denotes the space of homogeneous degree-...

متن کامل

Weighted Integrals of Polynomial Splines

The construction of weighted splines by knot insertion techniques such as deBoor and Oslo type algorithms leads immediately to the problem of evaluating integrals of polynomial splines with respect to the positive measure possessing piecewise constant density. It is for such purposes that we consider one possible way for simple and fast evaluation of primitives of products of a polynomial B-spl...

متن کامل

Curve clustering based on polynomial splines and nonsmooth optimisation

This paper examines clustering in datasets where each record is presented as a curve (trend). Our clustering approach is based on nonsmooth and nonconvex optimisation, namely the clustering problems have been formulated as mathematical programming problems and several optimisation methods from GANSO optimisation library have been applied to solve the problems. The least squares and uniform opti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1970

ISSN: 0021-9045

DOI: 10.1016/0021-9045(70)90042-0